Objects in a Higher-order Linear Logic Setting (extended Abstract)
نویسنده
چکیده
In 5] some aspects of object-oriented programming have been reformulated in the higher-order Linear Logic framework, F&O, based on the language Forum 14]. In particular, it has been shown how to logically represent objects encapsulating method deenitions and how to describe metarules deening message passing and self-application, according to diierent computational models. A language based on such concepts, YahOO, has been designed and implemented in the higher-order language-Prolog, adding a form of inheritance which could be handled at the moment of the objects creation. In the paper, the above mentioned features are reformulated in the setting of a more general framework based on Linear Logic 6], suitable to describe operational aspects of programming languages. Diierently from the authors' previous proposal 5], inheritance is reconsidered by deening, in logical terms, a delegation-based mechanism with characteristics similar to the ones presented in 1, 7]. Furthermore, the representation of an object is modiied in order to preserve encapsulation of methods in the newly deened setting where objects can be dynamically extended. Introduction to the logical aspects. The starting point of the case study presented in the
منابع مشابه
Linear Logic as Logic Programming: An Abstract
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic re nement, Lolli [13], provide for various forms of abstraction (modules, abstract data types, and higher-order programming) but lack primitives for concurrency. The logic programming language, LO (Linear Objects) [2] ...
متن کاملImplementing a Program Logic of Objects in a Higher-Order Logic Theorem Prover
We present an implementation of a program logic of objects, extending that (AL) of Abadi and Leino. In particular, the implementation uses higher-order abstract syntax (HOAS) and—unlike previous approaches using HOAS—at the same time uses the built-in higher-order logic of the theorem prover to formulate specifications. We give examples of verifications, extending those given in [1], that have ...
متن کاملProofs as Computations in Linear Logic
The notions of uniform proof and resolution represent the foundations of the proof-theoretic characterization of logic programming. In the standard logic programming setting, however, the form of the formulas, namely Horn clauses, plays a crucial role in discriminating between programming and theorem proving. In order to design coherent extensions of Horn clause-based languages, proper counterp...
متن کاملForum: A Multiple-Conclusion Specification Logic
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, λProlog and its linear logic refinement, Lolli [15], provide for various forms of abstraction (modules, abstract data types, and higher-order programming) but lack primitives for concurrency. The logic programming language, LO (Linear Objects) [2...
متن کاملForum: a Multiple-conclusion Speciication Logic
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic reenement, Lolli 15], provide for various forms of abstraction (modules, abstract data types, and higher-order programming) but lack primitives for concurrency. The logic programming language, LO (Linear Objects) 2] pr...
متن کامل